Stateless Proportional Bandwidth Allocation
نویسندگان
چکیده
This paper proposes a new method of bandwidth allocation during congestion, called the proportional allocation of bandwidth. Traditionally, max-min fairness has been proposed to allocate bandwidth under congestion. Our allocation scheme considers the situation where flows might have different subscribed information rates, based on their origin. In proportional allocation of bandwidth, during congestion all flows get a share of available bandwidth, which is in proportion to their subscribed information rate. We suggest a method for implementing this with minimum signaling and without storing per-flow state. Our method is based on the principles of differentiated services – diffserv. We show by simulation that it is possible to obtain proportional bandwidth allocation without per-flow state storing and minimum signaling.
منابع مشابه
Assuring Fair Allocation of Excess Bandwidth in Reservation Based Core-Stateless Networks
Assuring guaranteed services and providing fair bandwidth sharing are much sought characteristics in the current network architecture research. The IntServ approaches achieve those characteristics but only at the expense of using per-flow states and signaling, which are not scalable and difficult to implement. Alternatively, the stateless approaches proposed up to now are focused either on prov...
متن کاملCore Stateless Fair Bandwidth Allocation for Unicast and Multicast Flows
In this paper we aim at developing a solution to fairly allocating bandwidth among unicast and multicast flows. For this purpose, we propose the anycast max-min fairness criterion, which is based on the well known max-min fairness criterion for unicast. We then present an efficient implementation of the proposed criterion: the Multicast Fair Bandwidth Allocation (MFBA) architecture. The MFBA ar...
متن کاملCHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation
We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By ...
متن کاملA stateless active queue management scheme for approximating fair bandwidth allocation
We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...
متن کاملAdaptive CSFQ: A New Fair Queuing Mechanism for SCORE Networks
In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...
متن کامل